New active set identification for general constrained optimization and minimax problems
نویسندگان
چکیده
منابع مشابه
A New Active Set Algorithm for Box Constrained Optimization
An active set algorithm (ASA) for box constrained optimization is developed. The algorithm consists of a nonmonotone gradient projection step, an unconstrained optimization step, and a set of rules for branching between the two steps. Global convergence to a stationary point is established. For a nondegenerate stationary point, the algorithm eventually reduces to unconstrained optimization with...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملA Two-Stage Active-Set Algorithm for Bound-Constrained Optimization
In this paper, we describe a two-stage method for solving optimization problems with bound constraints. It combines the active-set estimate described in [1] with a modification of the nonmonotone line search framework recently proposed in [2]. In the first stage, the algorithm exploits a property of the active-set estimate that ensures a significant reduction of the objective function when sett...
متن کاملApproximate Fenchel-Lagrangian Duality for Constrained Set-Valued Optimization Problems
In this article, we construct a Fenchel-Lagrangian ε-dual problem for set-valued optimization problems by using the perturbation methods. Some relationships between the solutions of the primal and the dual problems are discussed. Moreover, an ε-saddle point theorem is proved.
متن کاملActive Set Identification for Linearly Constrained Minimization Without Explicit Derivatives
We consider active set identification for linearly constrained optimization problems in the absence of explicit information about the derivative of the objective function. We begin by presenting some general results on active set identification that are not tied to any particular algorithm. These general results are sufficiently strong that, given a sequence of iterates converging to a Karush–K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2015
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2014.07.041